An Ordering Theorem for Conditionally Independent and Identically Distributed Random Variables
نویسندگان
چکیده
منابع مشابه
Conditionally independent random variables
In this paper we investigate the notion of conditional independence and prove several information inequalities for conditionally independent random variables. Keywords— Conditionally independent random variables, common information, rate region.
متن کاملComparison of Sums of Independent Identically Distributed Random Variables
Let Sk be the k-th partial sum of Banach space valued independent identically distributed random variables. In this paper, we compare the tail distribution of ‖Sk‖ with that of ‖Sj‖, and deduce some tail distribution maximal inequalities. The main result of this paper was inspired by the inequality from [dP–M] that says that Pr(‖X1‖ > t) ≤ 5 Pr(‖X1 +X2‖ > t/2) whenever X1 and X2 are independent...
متن کاملGenerating the Maximum of Independent Identically Distributed Random Variables
Frequently the need arises for the computer generation of variates that are exact/y distributed as 2 = max(X,, . , X.) where X,, . . . , X, form a sequence of independent identically distributed random variables. For large n the individual generation of the Xi’s is unfeasible, and the inversion-of-a-beta-variate is potentially inaccurate. In this paper, we discuss and compare the corrected inve...
متن کاملOn the Invariance Principle for Sums of Independent Identically Distributed Random Variables
The paper deals with the invariance principle for sums of independent identically distributed random variables. First it compares the different possibilities of posing the problem. The sharpest results of this theory are presented with a sketch of their proofs. At the end of the paper some unsolved problems are given.
متن کاملSaddlepoint approximations for the sum of independent non-identically distributed binomial random variables
We discuss saddlepoint approximations to the distribution of the sum of independent nonidentically distributed binomial random variables. The saddlepoint solution is the root of a polynomial equation. The paper provides an expression for the coefficients of a polynomial of any degree, the root of which can be found using a simple root-finding algorithm. We examine the accuracy of the saddlepoin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1977
ISSN: 0090-5364
DOI: 10.1214/aos/1176343794